On language equations with invertible operations.dvi
نویسنده
چکیده
The paper studies language equations of the type X ⋄ L = R and L ⋄ Y = R, where L and R are given languages and ⋄ is an invertible binary word(language) operation. For most of the considered insertion and deletion operations, the existence of both a solution and a singleton solution to these equations proves to be decidable for given regular L and R. In case L is a context-free language and R is a regular one, the existence of a solution is generally undecidable. The results can be extended to more complex linear equations, systems of linear equations as well as for equations of higher degree.
منابع مشابه
Invertible insertion and deletion operations.dvi
The paper investigates the way in which the property of a language operation ⋄ ”to be invertible” helps in solving language equations of the type L⋄Y = R. In the beginning, the simple case where ⋄ denotes catenation is studied, but the results are then generalized for various invertible insertion and deletion operations. For most of the considered operations ⋄, the problem ”Does there exist a s...
متن کاملSOME REMARKS ON WEAKLY INVERTIBLE FUNCTIONS IN THE UNIT BALL AND POLYDISK
We will present an approach to deal with a problem of existence of (not) weakly invertible functions in various spaces of analytic functions in the unit ball and polydisk based on estimates for integral operators acting between functional classes of different dimensions.
متن کاملGroup Actions as Stroboscopic Maps of Ordinary Differential Equations
Non-invertible discrete-time dynamical systems can be derived from group actions. In the present work possibility of application of this method to systems of ordinary differential equations is studied. Invertible group actions are considered as possible candidates for stroboscopic maps of ordinary differential equations. It is shown that a map on SU (2) group interpolates exactly a flow of the ...
متن کاملUSING FRAMES OF SUBSPACES IN GALERKIN AND RICHARDSON METHODS FOR SOLVING OPERATOR EQUATIONS
In this paper, two iterative methods are constructed to solve the operator equation $ Lu=f $ where $L:Hrightarrow H $ is a bounded, invertible and self-adjoint linear operator on a separable Hilbert space $ H $. By using the concept of frames of subspaces, which is a generalization of frame theory, we design some algorithms based on Galerkin and Richardson methods, and then we in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994